Canonical tree-decompositions of finite graphs I. Existence and algorithms
نویسندگان
چکیده
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the graph.
منابع مشابه
Canonical tree-decompositions of finite graphs II. Essential parts
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish lower bounds on the number of parts in these decompositions that contain such a block or tangle, and determine conditions under which such parts contain nothing but a k-block.
متن کاملLINKED TREE-DECOMPOSITIONS OF INFINITE REPRESENTED MATROIDS By
It is natural to try to extend the results of Robertson and Seymour’s Graph Minors Project to other objects. As linked tree-decompositions (ltds) of graphs played a key role in the Graph Minors Project, establishing the existence of ltds of other objects is a useful step towards such extensions. There has been progress in this direction for both infinite graphs and matroids. Kříž and Thomas pro...
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملSimplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملSize-Constrained Tree Decompositions
Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 116 شماره
صفحات -
تاریخ انتشار 2016